#include <bits/stdc++.h>
using namespace std;
const int N=1e5+50;
const int MAXN=INT_MAX;
bool cmp(int a,int b){
    return a<b;
}
bool vis[N];
int r[N];
int ans;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    memset(vis,true,sizeof(vis));
    int n;
    scanf("%d",&n);
    ans=n;
    for(int i=1;i<=n;i++){
        scanf("%d",&r[i]);
    }
    sort(r+1,r+1+n,cmp);
    for(int i=1;i<=n;i++){
        if(vis[i]==false||r[i]==MAXN){
            continue;
        }
        for(int j=i-1;j>=1;j--){
            if(j==i||r[i]==MAXN||r[i]==r[j]){
                continue;
            }
            if(r[i]>r[j]){
                vis[i]=false;
                r[j]=MAXN;
                ans--;
                break;
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}
/*
5
1 2 3 1 2

10
136 136 136 2417 136 136 2417 136 136 136
*/
